#include <bits/stdc++.h> 
using namespace std; 

int binarySearch(int arr[], int l, int r, int x) 
{ 
	while (l <= r) { 
		int m = l + (r - l) / 2; 

		if (arr[m] == x) return m; 
		if (arr[m] < x) l = m + 1; 
        else r = m - 1; 
	} 

	return -1; 
} 

int main(void) 
{ 
    int n,x; //x is the element that is to be searched.
    cin>>n>>x;
	int arr[n]; 
	for(int i = 0;i<n;i++){
      cin>>arr[i];
    }
	 
	int result = binarySearch(arr, 0, n - 1, x); 
	(result == -1) ? cout << "Element is not present in array" : cout << "Element is present at index " << result; 
	return 0; 
} 